1930C - Lexicographically Largest - CodeForces Solution

#include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main()
{
    int t;
    cin >> t;
    int n;
    int x;
    while(t--){
        cin >> n;
        vector<int> a;
        for(int i=1; i<=n; i++){
            cin >> x;
            a.push_back(x+i);
        }
        
        sort(a.rbegin(), a.rend());
        
        cout << a[0] << " ";
        
        for(int i=1; i<n; i++){
            if(a[i]>=a[i-1]){
                a[i] = a[i-1] - 1;
            }
            
            cout << a[i] << " ";
        }
        
        cout << endl;
        
    }
    
    

    return 0;
}